- uncountable model
- 不可数模型
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
uncountable model
Look at other dictionaries:
Uncountable set — Uncountable redirects here. For the linguistic concept, see Uncountable noun. In mathematics, an uncountable set is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal… … Wikipedia
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … Wikipedia
Non-standard model — See also Interpretation (logic) In model theory, a discipline within mathematical logic, a non standard model is a model of a theory that is not isomorphic to the intended model (or standard model). If the intended model is infinite and the… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Morley's categoricity theorem — Vaught s test redirects here. Not to be confused with the Tarski–Vaught test. Categorical theory redirects here. Not to be confused with Category Theory. In model theory, a branch of mathematical logic, a theory is κ categorical (or categorical… … Wikipedia
Countable set — Countable redirects here. For the linguistic concept, see Count noun. Not to be confused with (recursively) enumerable sets. In mathematics, a countable set is a set with the same cardinality (number of elements) as some subset of the set of… … Wikipedia
Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… … Wikipedia
Löwenheim–Skolem theorem — In mathematical logic, the Löwenheim–Skolem theorem, named for Leopold Löwenheim and Thoralf Skolem, states that if a countable first order theory has an infinite model, then for every infinite cardinal number κ it has a model of size κ. The… … Wikipedia
Spectrum of a theory — In model theory, a branch of mathematical logic, the spectrum of a theory is given by the number of isomorphism classes of models in various cardinalities. More precisely, for any complete theory T in a language we write I(T, α) for the number of … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Covering lemma — See also: Jensen s covering theorem In mathematics, under various anti large cardinal assumptions, one can prove the existence of the canonical inner model, called the Core Model, that is, in a sense, maximal and approximates the structure of V.… … Wikipedia
